An optimal maximal independent set algorithm for bounded-independence graphs
نویسندگان
چکیده
منابع مشابه
Towards an Optimal Distributed Algorithm for Maximal Independent Set
The Maximal Independent Set (MIS) problem is one of the basics in the study of locality in distributed graph algorithms. This paper presents an extremely simple randomized algorithm providing a near-optimal local complexity for this problem, which incidentally, when combined with some known techniques, also leads to a near-optimal global complexity. Classical MIS algorithms of Luby [STOC’85] an...
متن کاملAn Optimal Algorithm to Find Maximum Independent Set and Maximum 2-Independent Set on Cactus Graphs
A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to find a maximum independent set and maximum 2-independent set on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.
متن کاملAn Improved Distributed Algorithm for Maximal Independent Set
The Maximal Independent Set (MIS) problem is one of the basics in the study of locality in distributed graph algorithms. This paper presents a very simple randomized algorithm for this problem providing a near-optimal local complexity, which incidentally, when combined with some known techniques, also leads to a near-optimal global complexity. Classical MIS algorithms of Luby [STOC’85] and Alon...
متن کاملA Parallel Maximal Independent Set Algorithm
The parallel construction ofmaximal independent sets is a useful building block for many algorithms in the computational sciences, including graph coloring and multigrid coarse grid creation on unstructured meshes. We present an e cient asynchronous maximal independent set algorithm for use on parallel computers, for \well partitioned" graphs, that arise from nite element (FE) models. For appro...
متن کاملFast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time randomized algorithm for general graphs [20], no deterministic polylogarithmic algorithm is known. In this paper, we study the problem in graphs with bounded growth, an important family of graphs which includes the well-known u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2010
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-010-0097-1